• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)

Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) ACDE©÷: ¼ö·Å ¼Óµµ°¡ Çâ»óµÈ ÀûÀÀÀû Äڽà ºÐÆ÷ Â÷ºÐ ÁøÈ­ ¾Ë°í¸®Áò
¿µ¹®Á¦¸ñ(English Title) ACDE©÷: An Adaptive Cauchy Differential Evolution Algorithm with Improved Convergence Speed
ÀúÀÚ(Author) ÃÖÅÂÁ¾   ¾Èâ¿í   Tae Jong Choi   Chang Wook Ahn  
¿ø¹®¼ö·Ïó(Citation) VOL 41 NO. 12 PP. 1090 ~ 1098 (2014. 12)
Çѱ۳»¿ë
(Korean Abstract)
ÀÌ ¿¬±¸´Â ´ÜºÀ Àü¿ª ÃÖÀûÈ­ ¼º´ÉÀÌ °³¼±µÈ ÀûÀÀÀû Äڽà ºÐÆ÷ Â÷ºÐ ÁøÈ­ ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. ±âÁ¸ ÀûÀÀÀû Äڽà ºÐÆ÷ Â÷ºÐ ÁøÈ­ ¾Ë°í¸®ÁòÀº(ACDE) °³Ã¼ÀÇ ´Ù¾ç¼ºÀ» º¸ÀåÇÏ¿© ´ÙºÀ Àü¿ª ÃÖÀûÈ­ ¹®Á¦¿¡ ¿ì¼öÇÑ ¡°DE/rand/1¡± µ¹¿¬º¯ÀÌ Àü·«À» »ç¿ëÇß´Ù. ±×·¯³ª ÀÌ µ¹¿¬º¯ÀÌ Àü·«Àº ¼ö·Å ¼Óµµ°¡ ´À·Á ´ÜºÀ Àü¿ª ÃÖÀûÈ­ ¹®Á¦¿¡ ´ÜÁ¡ÀÌ ÀÖ´Ù. Á¦¾È ¾Ë°í¸®ÁòÀº ¡°DE/rand/1¡± µ¹¿¬º¯ÀÌ Àü·« ´ë½Å ¼ö·Å ¼Óµµ°¡ ºü¸¥ ¡°DE/current-to-best/1¡± µ¹¿¬º¯ÀÌ Àü·«À» »ç¿ëÇß´Ù. À̶§, °³Ã¼ÀÇ ´Ù¾ç¼ºÀÌ ºÎÁ·ÇÏ¿© ¹ß»ýÇÒ ¼ö ÀÖ´Â Áö¿ª ÃÖÀûÇØ·ÎÀÇ ¼ö·ÅÀ» ¹æÁöÇϱâ À§Çؼ­ ¸Å°³º¯¼ö ÃʱâÈ­ ¿¬»êÀÌ Ãß°¡µÆ´Ù. ¸Å°³º¯¼ö ÃʱâÈ­ ¿¬»êÀº ƯÁ¤¼¼´ë¸¦ ÁÖ±â·Î ½ÇÇàµÇ°Å³ª ¶Ç´Â ¼±Åà ¿¬»ê¿¡¼­ ¸ðµç °³Ã¼°¡ ÁøÈ­¿¡ ½ÇÆÐÇÏ´Â °æ¿ì ½ÇÇàµÈ´Ù. ¸Å°³º¯¼ö ÃʱâÈ­ ¿¬»êÀº °¢ °³Ã¼µéÀÇ ¸Å°³º¯¼ö¿¡ ŽÇèÀû Ư¼ºÀÌ ³ôÀº °ªÀ» ÇÒ´çÇÏ¿© ³ÐÀº °ø°£À» Ž»öÇÒ ¼ö ÀÖµµ·Ï º¸ÀåÇÑ´Ù. ¼º´É Æò°¡ °á°ú, °³¼±µÈ ÀûÀÀÀû Äڽà ºÐÆ÷ Â÷ºÐ ÁøÈ­ ¾Ë°í¸®ÁòÀÌ ÃֽŠÂ÷ºÐ ÁøÈ­ ¾Ë°í¸®Áòµé¿¡ ºñÇØ Æ¯È÷, ´ÜºÀ Àü¿ª ÃÖÀûÈ­ ¹®Á¦¿¡¼­ ¼º´ÉÀÌ °³¼±µÊÀ» È®ÀÎÇß´Ù.
¿µ¹®³»¿ë
(English Abstract)
In this paper, an improved ACDE (Adaptive Cauchy Differential Evolution) algorithm with faster convergence speed, called ACDE2, is suggested. The baseline ACDE algorithm uses a "DE/rand/1" mutation strategy to provide good population diversity, and it is appropriate for solving multimodal optimization problems. However, the convergence speed of the mutation strategy is slow, and it is therefore not suitable for solving unimodal optimization problems. The ACDE2 algorithm uses a "DE/current-to-best/1" mutation strategy in order to provide a fast convergence speed, where a control parameter initialization operator is used to avoid converging to local optimization. The operator is executed after every predefined number of generations or when every individual fails to evolve, which assigns a value with a high level of exploration property to the control parameter of each individual, providing additional population diversity. Our experimental results show that the ACDE2 algorithm performs better than some state-of-the-art DE algorithms, particularly in unimodal optimization problems.
Å°¿öµå(Keyword) Àΰø Áö´É   ÁøÈ­ ¿¬»ê ¹× À¯Àü ¾Ë°í¸®Áò   Àü¿ª ÃÖÀûÈ­  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå